On Tuza’s conjecture for triangulations and graphs with small treewidth
نویسندگان
چکیده
Tuza (1981) conjectured that the size ? ( G ) of a minimum set edges intersects every triangle graph is at most twice ? maximum edge-disjoint triangles . In this paper we present three results regarding Tuza’s Conjecture. We verify it for graphs with treewidth 6; show ? 3 2 planar triangulation different from K 4 ; and 9 5 + 1 if maximal 3. Our first result strengthens Tuza, implying 8 -free chordal
منابع مشابه
Treewidth for Graphs with Small Chordality
A graph G is k-chordal, if it does not contain chordless cycles of length larger than k. The chordality Ic of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs. Our results are the following: ( 1) The problem of treewidth remains NP-complete when restricted to graphs with small maximum degree. (2) An upp...
متن کاملOn Reduction Algorithms for Graphs with Small Treewidth
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is shown that the method can not only be applied to solve decision problems, but also some optimization problems and construction variants of several of these problems on graphs with some constant upper bound on the treewidth. Also, the exisitence is shown of nite, safe, complete, and terminating sets o...
متن کاملReduction Algorithms for Graphs of Small Treewidth
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs of bounded treewidth, by using a finite set of reduction rules. These algorithms can be used to solve problems on graphs of bounded treewidth without the need to first obtain a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112281